Postulate-sets for Boolean Rings

نویسنده

  • B. A. BERNSTEIN
چکیده

1. Introduction. Boolean rings (or generalized Boolean algebras), defined by Stone, are rings in which every element is idempotent. Sets of postulates for these rings have been given by Stone(2) and by Stabler(8). I give in this paper a number of additional postulate-sets for such rings. The sets are all expressed in terms of ring addition and multiplication. Stone's postulates for Boolean rings in terms of ring operations are given as set S below; Stabler's postulates of this type are sets S' and S" below. The additional sets of the present paper are sets I-IX below. Stone has not undertaken the task of eliminating possible redundancies from his set S, and Stabler raised the question of independence of his set S' when a unit-element postulate is added to S'. It will be shown that, except for an overlooked redundancy, set S is independent and that S' remains independent after the addition of a unit-element postulate. The latter fact will be shown to hold also for set S, without the redundancy, and for sets S",

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Completeness results for metrized rings and lattices

The Boolean ring $B$ of measurable subsets of the unit interval, modulo sets of measure zero, has proper radical ideals (for example, ${0})$ that are closed under the natural metric, but has no prime ideal closed under that metric; hence closed radical ideals are not, in general, intersections of closed prime ideals. Moreover, $B$ is known to be complete in its metric. Togethe...

متن کامل

Omega-almost Boolean rings

In this paper the concept of an $Omega$- Almost Boolean ring is introduced and illistrated how a sheaf of algebras can be constructed from an $Omega$- Almost Boolean ring over a locally Boolean space.

متن کامل

Propagation Models and Fitting Them for the Boolean Random Sets

In order to study the relationship between random Boolean sets and some explanatory variables, this paper introduces a Propagation model. This model can be applied when corresponding Poisson process of the Boolean model is related to explanatory variables and the random grains are not affected by these variables. An approximation for the likelihood is used to find pseudo-maximum likelihood esti...

متن کامل

INDEPENDENT SETS OF SOME GRAPHS ASSOCIATED TO COMMUTATIVE RINGS

Let $G=(V,E)$ be a simple graph. A set $Ssubseteq V$ isindependent set of $G$,  if no two vertices of $S$ are adjacent.The  independence number $alpha(G)$ is the size of a maximumindependent set in the graph. In this paper we study and characterize the independent sets ofthe zero-divisor graph $Gamma(R)$ and ideal-based zero-divisor graph $Gamma_I(R)$of a commutative ring $R$.

متن کامل

Boolean Gröbner Basis Reductions on Datapath Circuits Using the Unate Cube Set Algebra

Recent developments in formal datapath verification make efficient use of symbolic computer algebra algorithms for formal verification. The circuit is modeled as a set of polynomials over Boolean (or pseudo-Boolean) rings, and Gröbner basis (GB) reductions are performed over these polynomials to derive a canonical representation. GB reductions of Boolean polynomials tend to cause intermediate e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010